Mental-Map Preserving Visualisation of Partitioned Networks in Vanted

Preserving the Mental Map using Foresighted Layout

Mental map preserving graph drawing using simulated annealing

Visualizing graphs has been studied extensively in the community of graph drawing and information visualization over the years. In some applications, the user is required to interact with a graph by making slight changes to the underlying graph structure. To visualize graphs in such an interactive environment, it is desirable that the differences between the displays of the original and the mod...

Privacy-Preserving Datamining on Vertically Partitioned Databases

In a recent paper Dinur and Nissim considered a statistical database in which a trusted database administrator monitors queries and introduces noise to the responses with the goal of maintaining data privacy [5]. Under a rigorous definition of breach of privacy, Dinur and Nissim proved that unless the total number of queries is sub-linear in the size of the database, a substantial amount of noi...

Privacy-preserving horizontally partitioned linear programs

We propose a simple privacy-preserving reformulation of a linear program whose equality constraint matrix is partitioned into groups of rows. Each group of matrix rows and its corresponding right hand side vector are owned by a distinct private entity that is unwilling to share or make public its row group or right hand side vector. By multiplying each privately held constraint group by an appr...

Agreement in Partitioned Dynamic Networks

In the dynamic network model, the communication graph is assumed to be connected in every round but is otherwise arbitrary. We consider the related setting of p-partitioned dynamic networks, in which the communication graph in each round consists of at most p connected components. We explore the problem of k-agreement in this model for k ≥ p. We show that if the number of processes is unknown t...